Unification Algorithms Cannot Be Combined in Polynomial Time
نویسندگان
چکیده
منابع مشابه
Unification Algorithms Cannot be Combined in Polynomial Time
We establish that there is no polynomial-time general combination algorithm for uniication in nitary equational theories, unless the complexity class #P of counting problems is contained in the class FP of function problems solvable in polynomial-time. The prevalent view in complexity theory is that such a collapse is extremely unlikely for a number of reasons, including the fact that the conta...
متن کاملQuantum Zero-Error Algorithms Cannot be Composed
We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-error. This shows that quantum zero-error algorithms cannot be composed. In oracle terms, we give a relativized world where ZQP 6= ZQP, while classically we always have ZPP = ZPP.
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملPolynomial-Time Approximation Algorithms
• Assume that the input is random, and find an algorithm that will perform well in the average case. For example, the maximum clique problem, which is NP -hard, can actually be solved efficiently assuming a random input because the maximum clique in a randomly chosen graph is small. This assumption is often used in practice, but the problem is that not everyone will agree on whether the input d...
متن کاملTwo-Restricted One Context Unification is in Polynomial Time
One Context Unification (1CU) extends first-order unification by introducing a single context variable. This problem was recently shown to be in NP, but it is not known to be solvable in polynomial time. We show that the case of 1CU where the context variable occurs at most twice in the input (1CU2r) is solvable in polynomial time. Moreover, a polynomial representation of all solutions can be c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2000
ISSN: 0890-5401
DOI: 10.1006/inco.1999.2855